Data streaming and backup systems having multiple concurrent read threads for improved small file performance

ABSTRACT

Permitting multiple concurrent read operations upon a file system enhances small file performance. A respective instance of a thread routine stores the data from each file into a series of buffers for the file. Each instance is identified by a Process Identifier (PID) used for streaming the data from the buffers in the order in which the files are opened instead of the order in which the file data are returned by the read operations. In order to conserve buffer memory, read operations upon a file are suspended once a certain amount of data have been read from the file unless data from the file are being streamed from the buffers.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates generally to data processing networks, and more particularly to data storage systems and file servers. The present invention relates specifically to streaming data from a multiplicity of files.

2. Description of Related Art

Data streaming from a multiplicity of files typically occurs during a backup operation or a migration operation. For backup, data from selected files of a file system are written to backup media such as magnetic tape. For migration, data from selected files of a file system are copied from one file server to another file server.

For backup to tape, it is very desirable to maintain a relatively continuous stream of data from storage to the tape drive so that the tape can be transported at a relatively constant and high rate of speed as the stream of data is written to the tape. This ensures that the data stream is written to tape at the maximum possible rate, and the tape is not stressed by unnecessary acceleration and deceleration.

One way of providing a relatively continuous stream of data from a number of files to tape is to use intermediate disk storage as a buffer between the files and the tape. For example, as described in Tzelnic et al., U.S. Pat. No. 5,829,046, issued Oct. 27, 1998 and incorporated herein by reference, network clients send backup data to a file server having a cached disk array and a tape silo. The cached disk array serves as a speed matching buffer and as a means for combining the data or files to be written to a particular tape cartridge in the tape silo.

More recently, it has become customary for network clients to keep their critical data on a network file server instead of on local disk storage. The network clients expect the critical data to be backed up automatically, and restored after any failure of the network file server. In this situation, the data to be backed up resides in files in disk storage of the network file server, and it is desirable to stream the data directly from the disk storage to tape. This has been done using multi-threaded backup software in the file server, including a remote control thread, a file opening thread, a file reading thread, and a tape writing thread, as further described below with reference to FIGS. 2 to 7.

In general, a thread is a single, sequential flow of control within a process. Within each thread there is a single point of execution. Each thread has it own set of register values. Therefore, each thread is a single instance of a program routine. A single processor can execute no more than one thread at any given time, but the processor may suspend execution of one thread to begin execution of another thread. The operating system can schedule execution of a thread, suspend execution of a thread, resume execution of a thread, and terminate execution of a thread. The operating system can schedule the execution of threads on a priority basis, and threads of the same priority can be executed on a time-share basis. In this fashion, a multithreaded program can perform computations while waiting for completion of a read or write to disk or while waiting for receipt of a packet from a data network.

There are various standards and software tools to help a programmer writing a multithreaded program. For example, IEEE Std 1003.1-1996 includes a Threads Extension for the Portable Operating Systems Interface (POSIX®) to open systems. This Threads Extension, called POSIX1c, has been included in the Single UNIX Specification, Version 2, as described in “Threads and the Single Unix® Specification,” Version 2, May 1997, by The Open Group, 8 New England Executive Park, Suite 325 Burlington Mass. 01803-5007, opengroup.org, and in the “Unix® Systems Threads Reference,” also by the Open Group. Another implementation of the IEEE® POSIX® standard is described in “Tru64 UNIX Guide to DECthreads,” July 1999, by the Compaq division of Hewlett-Packard, hp.com.

SUMMARY OF THE INVENTION

In accordance with a first aspect, the invention provides a method of streaming data from a series of files in a file system. The method includes initiating a series of concurrent file read requests and providing a respective thread for handling data read from each file in the series of files, the respective thread for handling data from each file transferring the data read from the file into a series of buffers for the file. The method further includes streaming data from the buffers.

In accordance with another aspect, the invention provides a method of streaming data from a file system. The method includes searching the file system to find a series of files in the file system, and upon finding a file to be included in the series of files in the file system, creating a respective instance of a thread routine for handling file data returned from a read operation upon the file and initiating the read operation upon the file so that there are multiple concurrent read operations pending to multiple files in the series of files in the file system. The method also includes the respective instance of the thread routine for handling file data returned from the read operation upon the file and determining whether there are additional data in the file and upon finding that there are additional data in the file initiating at least one additional read operation upon the file, and placing all of the data of the file into a respective series of buffers for the file. The method further includes streaming the data from the buffers in the order of the series of files in the file system.

In accordance with another aspect, the invention provides a method of streaming data from a series of files stored in a file server. The series of files is indicated by a list of the files. The method includes the file server streaming the data from buffers indicated by a write list of buffers, and the file server executing concurrent instances of a thread routine. Execution of each instance of the thread routine includes obtaining ownership of the list of files, and upon obtaining ownership of the list of files, obtaining a file from the list of files and reading data from the file obtained from the list of files and storing the data read from the file obtained from the list of files into buffers on a respective local list of buffers for the instance of the thread routine, and then obtaining ownership of the write list, and upon obtaining ownership of the write list, linking the local list of buffers to the write list.

In accordance with another aspect, the invention provides a file server. The file server includes data storage for storing a file system, and a processor programmed for streaming data from a series of files in the file system. The processor is programmed for initiating a series of concurrent file read requests and providing a respective thread for handling data read from each file in the series of files. The respective thread for handling data from the file transfers the data read from the file into a series of buffers for the file. Moreover, the processor is programmed for streaming data from the buffers.

In accordance with still another aspect, the invention provides a file server. The file server includes storage containing a file system, and a processor programmed for searching the file system to find a series of files in the file system, and upon finding a file to be included in the series of files in the file system, initiating a respective instance of a thread routine for handling file data returned from a read operation upon the file and initiating the read operation upon the file so that there are multiple concurrent read operations pending to multiple files in the series of files in the file system. The thread routine is programmed for handling file data returned from the read operation upon the file by determining whether there are additional data in the file and upon finding that there are additional data in the file initiating at least one additional read operation upon the file, and placing all of the data of the file into a respective series of buffers for the file. The processor is also programmed for streaming the data from the buffers in the order of the series of files in the file system.

In accordance with a final aspect, the invention provides a file server including data storage for storing a file system, and a processor programmed for streaming data from a series of files in the file system. The series of files is indicated by a list of the files. The processor is programmed with a routine for streaming data from buffers in a write list of buffers. The processor is also programmed for concurrent execution of instances of a thread routine. Each instance of the thread routine is executable for obtaining ownership of the list of files, and upon obtaining ownership of the list of files, obtaining a file from the list of files and reading data from the file obtained from the list of files and storing the data read from the file obtained from the list of files into buffers on a respective local list of buffers for the instance of the thread routine, and then obtaining ownership of the write list, and upon obtaining ownership of the write list, linking the local list of buffers to the write list.

BRIEF DESCRIPTION OF THE DRAWINGS

Other objects and advantages of the invention will become apparent upon reading the detailed description with reference to the drawings, in which:

FIG. 1 is a block diagram of a network file server;

FIG. 2 is a block diagram showing “prior art” backup software that has been used in the network file server of FIG. 1;

FIG. 3 is a flowchart of a Network Data Management Protocol (NDMP) thread used in FIG. 2 for responding to a backup request from a system administrator;

FIG. 4 is a flowchart of a thread used in FIG. 2 for opening a file;

FIGS. 5-6 comprise a flowchart of a thread used in FIG. 2 for reading a file;

FIG. 7 is a flowchart of a thread used in FIG. 2 for writing to tape;

FIG. 8 shows an example of backup software incorporating the present invention;

FIG. 9 shows the organization of a local list of buffers used in FIG. 7;

FIG. 10 shows thread locking information for maintaining a queue of multiple instances of a thread routine used in FIG. 7 for reading files;

FIGS. 11-12 show a flowchart of a routine used in the backup software of FIG. 8 for creating multiple instances of a backup thread routine for reading files;

FIGS. 13-15 show a flowchart of the backup thread routine for reading files;

FIG. 16 shows various components of the data mover in the file server of FIG. 1;

FIG. 17 shows the streaming of data from the file system to the windows client of FIG. 16;

FIG. 18 shows a pool of threads for a Common File System (CFS) layer in the data mover FIG. 16;

FIG. 19 is a flowchart of a CFS routine for reading 64 kilobytes at an offset of zero in a single file;

FIG. 20 is a flow diagram showing interaction between various objects during execution of the procedure of FIG. 19;

FIG. 21 is a flowchart of a block read thread used in the procedure of FIG. 19;

FIGS. 22 and 23 comprise a flowchart of a main thread used in the procedure of FIG. 19; and

FIG. 24 is a flowchart of a prefetch thread used in the procedure of FIG. 19.

While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof have been shown by way of example in the drawings and will be described in detail. It should be understood, however, that it is not intended to limit the form of the invention to the particular forms shown, but on the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the scope of the invention as defined by the appended claims.

DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS

FIG. 1 shows a network file server 20 including multiple data mover computers 21, 22 for moving data between a cached disk array 23, a tape library unit 24, and an IP network 25. The network file server 20 also has dual redundant controller servers 28, 29 connected via a dedicated dual-redundant data link 26 among the data movers. The controller servers 28, 29 also share a link to a display and keyboard 32 for configuring the data movers 21, 22 and the cached disk array 23. The controller servers 28, 29 also share a link 30 to the IP network 25 permitting a system administrator 33 at a workstation 34 to monitor, configure, and control the network file server 20. For example, the system administrator 33 can schedule backup of selected files in a file system 35 in the cached disk array 23 to a tape cartridge 36 in the tape library unit 24.

Further details regarding the network file server 20 are found in Vahalia et al., U.S. Pat. No. 5,893,140, issued Apr. 6, 1999, incorporated herein by reference, and Xu et al., U.S. Pat. No. 6,324,581, issued Nov. 27, 2001, incorporated herein by reference. The network file server 20 is managed as a dedicated network appliance, integrated with popular network operating systems in a way, which, other than its superior performance, is transparent to the end user. The clustering of the data movers 21, 22 as a front end to the cached disk array 23 provides parallelism and scalability.

Each of the data movers 21, 22, is a high-end commodity computer, providing the highest performance appropriate for a data mover at the lowest cost. The data mover computers 21, 22 may communicate with other network devices using standard file access protocols such as the Network File System (NFS) or the Common Internet File System (CIFS) protocols, but the data mover computers do not necessarily employ standard operating systems. For example, the network file server 21 is programmed with a Unix-based file system that has been adapted for rapid file access and streaming of data between the cached disk array 23 and the IP network 25 by any one of the data mover computers 21, 22.

FIG. 2 shows backup software that has been used in the network file server of FIG. 1. In general, selected files of the file system 35 in storage of the cached disk array 23 are backup up to the tape cartridge 36 in the tape library unit 24 by reading data from each selected file from the file system 35 to data buffers 40 in the data mover 21, and then writing the data for the file from the data buffers 40 to the tape cartridge 36 in the tape library unit 24.

The backup software in the data mover 21 further includes a Network Data Management Protocol (NDMP) remote control interface routine 41 and three working threads for backing up files from disk to tape. These threads include a thread 42 called “NASS” for opening files, a thread 43 called “NASA” for reading data from open files, and a thread 44 called “NASW” for writing the data to tape.

The NDMP routine 41 receives a request to back up selected files in a specified file system 35. The NDMP routine 41 ensures that a tape cartridge 36 is mounted in a tape drive of the tape library unit 24 for receiving backup data from the selected files of the file system 35. The tape drive, for example, is a Small Computer System Interface (SCSI) device, and a device file is opened for the tape drive, causing a file descriptor to be associated with the tape drive. The NDMP routine 41 then invokes the NASS thread 42.

The NASS thread 42 traverses the file system 35 to determine the files that need to be backed up. The NASS thread 42 reads attributes for each file from the file system directory containing the file. If the file attributes indicate that the file should be backed up, then NASS 42 opens the file, places a file descriptor for the file in a list 45 of open files, and puts some file attributes including the file name into one of the meta data buffers 39. For example, for a “full” backup, a file should be backed up if it has an “archive” attribute set, and for an “incremental” backup, a file should be backed up if it has its “archive” attribute set and if its “last modified time” attribute is more recent than the time of the last backup of the file system. The file attributes in the meta data buffer will be written to the tape cartridge 36 as a header to the data of the file. The list 45 of open files functions as a pipeline queue for file reading tasks requested by the NASS thread 42 and performed by the NASA thread 43.

The NASA thread 43 works on any open files in the list 45. The NASA thread 43 reads data from each open file from the file system 35 into the data buffers 40. Once data have been written to one of the data buffers 40, a descriptor of the data buffer is added to a list of buffers 46. The descriptor, for example, includes a starting address of data in the buffer and a length of bytes written into the buffer. The list of buffers 46 functions as a pipeline queue for tape writing tasks requested by the NASA thread 43 and performed by the NASW thread 44.

When a backup starts, the NASA thread 43 puts sixty-four buffers into the pool of meta data buffers 39. Then the NASA thread 43 waits for NASS thread to fill the meta data buffers 39. The NASS thread 42 traverses the backup file system, fills meta data to the meta data buffers, and puts them back into the meta buffer pool 39. Upon getting a meta data buffer, the NASA thread writes file header structure, reads file data, and buffers the file data to the write block size. To keep the tape drive streaming, the NASA thread 43 holds the data buffers 40 until thirty data buffers are filled, and then releases the first data buffer to the data buffer pool 40. Then it releases the rest of the data buffer pool 40 immediately afterwards. Once the NASA thread 43 releases a data buffer, it can be accessed by the NASW thread 44 for writing data of the data buffer to the tape cartridge 36.

For each buffer in the list of buffers 46, the NASW thread 44 writes the data from the buffer to the tape cartridge 36. In a single write request to the tape library unit 24, for example, the NASW thread can specify up to 64 kilobytes of data to be written to the tape cartridge. Each write request can specify multiple buffers so that a scatter-gather operation is performed with respect to buffers that may contain much less than 64 kilobytes of data. For example, the NASW thread 44 calls a vector write function of the operating system to write the data from the buffers 40 to the tape cartridge 36. The vector write function has the following format: int writev(int fd, const struct iovec*vector, int count)

-   -   where iovec has the following format:     -   struct iovec {     -   _ptr_t iov_base; /* Starting address. */     -   size_t iov_len; /* Length in bytes. */     -   };

The vector write function (writev) writes data to the file descriptor fd, and from the buffers described by vector. The number of buffers is specified by count. The buffers are used in the order specified. The vector write function is an atomic operation. In other words, if a thread invokes the vector write function, then the vector write function will complete regardless of whether the thread is suspended during performance of the vector write function. The Linux operating system, for example, provides such a vector write function.

FIG. 3 shows a flowchart of an NDMP routine for responding to a request for backup of a specified file system. In a first step 51, the NDMP routine opens a device file for a tape drive in the tape library unit, mounts a tape cartridge in the tape drive, and initiates a NASA thread as further described below with reference to FIGS. 5-6. Then in step 52, the NDMP routine starts a top-down, depth-first search for files in the specified file system. This causes a certain ordering of the files that is expected when backup is performed in response to a Unix “tar” command. In step 53, in accordance with the search, the NDMP routine reads a directory in the file system to obtain attributes of the next file found in the file system. In step 54, unless the end of the file system has been reached, execution continues to step 55. In step 55, the file attributes are compared to backup criteria. In step 56, if the file attributes indicate that the file should be backed up, then execution continues to step 57 to invoke the NASS routine to open the file. Once the file is opened, execution loops back to step 53. Execution also loops back to step 53 from step 56 if the file attributes indicate that the file should not be backed up. Eventually the end of the file system is reached in step 54, so that execution continues from step 54 to step 58. In step 58, the NDMP routine waits until the list of open files, the list of buffers, and a vector of data to be written to tape have become empty. Then in step 59, the NDMP routine dismounts the tape cartridge and closes the device file for the tape drive, and the NDMP routine is finished.

FIG. 4 shows the NASS thread for opening a file specified by the NDMP routine. In a first step 61, the NASS thread opens the file. In step 62, the NASS thread places the file attributes (from step 53 in FIG. 3) into a free buffer for the header to be written to the backup tape. In step 63, the NASS thread inserts a file descriptor for the opened file and a buffer descriptor for the header into the tail of the open file list. Finally, in step 64, the NASS thread invokes the NASA thread to read the file, and the NASS thread is finished.

FIG. 5 shows a flowchart of the NASA thread. In a first step 71, the NASA thread puts sixty-four buffers into the meta data buffer pool. Then the NASA thread waits until either the NASS thread fills these buffers in step 72 or until the end of the file system is reached in step 73. This is done so that the tape drive is not started until a good number of the files have been opened, in order to avoid discontinuous operation of the tape drive. In particular, execution branches from step 72 to step 73 if the meta data buffers are not filled, and from step 73 to step 74 if the end of the file system has not been reached. In step 74, the NASA thread is placed in a wait state until a meta data buffer has been filled or until the end of the file system has been reached. Once the meta data buffers have been filled or the end of the file system has been reached, execution continues from step 72 or step 73, respectively, to step 75.

In step 75, the NASA thread gets the file descriptor and the buffer descriptor from the head of the list of open files. Next, in step 76, the NASA thread inserts the buffer descriptor onto the tail of the list of buffers. In step 76, the NASA thread may also write additional information into this metadata buffer, in case the file header for the tape format includes more information than the metadata read from the directory entry for the file in the file system. In step 77, a free buffer is obtained, and file data are read into the buffer. In step 78, a descriptor for this buffer is inserted onto the tail of the list of buffers. Execution continues from step 78 of FIG. 5 to step 79 in FIG. 6.

In step 79 of FIG. 6, if thirty buffers have been filled, then execution branches to step 80 to activate the NASW thread to begin writing to tape. The tape drive is not started until a good number of the data buffers have been filled, in order to avoid discontinuous operation of the tape drive. Execution continues from step 79 or step 80 to step 81. In step 81, if the end of the file has not been reached, then execution loops back to step 77 of FIG. 5, in order to read additional data from the file. Once the end of the file has been reached, execution continues to step 82 to close the file. Execution continues from step 82 to step 83.

In step 83, if the list of open files is not empty, then execution loops back to step 75 of FIG. 5 to read data from the next file on the list of open files. Otherwise, execution branches from step 83 to step 84. In step 84, if the end of the file system has not been reached, then in step 85 the NASA thread is suspended and remains in a wait state until the NASS thread opens another file or until the NDMP routine indicates that the end of the file system has been reached and there are no more files to be opened. Then the NASA thread resumes and execution loops back from step 85 to step 83.

Once the end of the file system has been reached and there are no more files to be opened, execution continues from step 84 to step 86 to invoke the NASW thread to write to tape, in case step 80 was never reached because 30 data buffers were never filled. Then the NASA thread terminates.

FIG. 7 shows the NASW thread. The NASW thread assembles buffer descriptors from the list of buffers into a vector up to a maximum data length, and then issues the vector in a write request to the tape drive. This process is repeated until the list is empty and all data from all of the buffers have been written to the backup tape.

In a first step 191, the NASW thread clears a data length variable and clears a vector of buffer descriptors. Next, in step 192, the NASW thread looks at the buffer descriptor at the head of the list of buffers. In step 193, if the list of buffers is not empty, then execution continues to step 194. In step 194, the data length is incremented by the byte count of the buffer descriptor. In step 195, if the data length is not greater than a maximum limit, then execution continues to step 196. The maximum limit, for example, is 64 kilobytes. In step 196, the descriptor from the head of the list of buffers is removed and added to the vector. From step 196, execution loops back to step 192 to get a next descriptor from the list of buffers.

In step 195, if the data length would exceed the maximum limit, then execution branches from step 195 to 197. In step 197, if the tape drive is busy, the NASW thread is suspended and resumed in step 198 until the tape drive is no longer busy, and execution continues to step 199. For example, the tape drive is busy when it has received two pending vector write requests. After step 199, execution loops back to step 191 to assemble another vector write request. Once the list of buffers has become empty in step 193 and the vector is null in step 190, the NASW thread is finished.

In the backup system of FIG. 2, a performance issue may arise with respect to backup of very small files. For example, a large number of small files are typically found in an E-mail folder. In this situation, the NASA thread can become a bottleneck.

As shown in FIG. 8, backup performance can be improved substantially by permitting a modified NASA thread 103 to initiating multiple concurrent backup threads 100, 101, 102 for reading respective files, and permitting each backup thread to pre-fetch file data from its respective file into a respective local data buffer pool defined by a respective local list of buffers 106, 107. The active backup threads are arranged in a queue so that the order in which file data are written to tape is the same as the order in which the files are opened by the NASS thread 92.

Each backup thread has its own unique process identifier (PID), its own local list of buffers 106, 107, and a corresponding file descriptor of a file to be read by the backup thread. Each file opened by the NASS thread has one associated backup thread that reads the file. When the pre-fetched data for a backup thread are ready to be written to tape, the backup thread links its local list of buffers into the write list of buffers 105.

At the start of the backup operation, the modified NASA thread 103 initiates a certain number (N) of backup threads, depending on the expected size of the files to be backed up. For example, the number (N) of backup threads is programmable and has a default value of sixteen. Preferably, the number (N) of backup threads is programmed to range from a minimum of sixteen for files of about 100 kilobytes or more to a maximum of ninety-two for files of about eight kilobytes or less.

Each backup thread waits for an open file to be backed up. When the backup thread is assigned an open file to be backed up, it prefetches a certain amount of data from the open file. Two variables, “nass_owner” and “nasw_owner”, are used to keep the files backed up in the same order as the files are opened by the NASS thread. Nass_owner indicates the thread PID that has ownership of the list of open files 95 for the purpose of getting the meta data buffer of the next open file from the NASS thread 92. Nasw_owner indicates the thread PID that has ownership of the write list of buffers 105 for the purpose of passing a data buffer to the NASW thread 94.

Each backup thread waits for its PID to be indicated by nass_owner. Upon obtaining ownership of the NASS thread 92 and getting a next meta data buffer from the meta data buffer pool 90, the backup thread transfers ownership of the NASS thread to the next backup thread PID, links the meta data buffer into its local list of buffers, prefetchs up to a certain maximum number of data blocks from the file identified by metadata in the meta data buffer, waits for NASW ownership, finishes the reading of file data after getting the NASW ownership, and then transfers NASW ownership to the next backup thread PID.

The unique PID of each backup thread is assigned to the backup thread when the modified NASA thread 103 initiates the backup thread. Prior to initiation of the backup threads, the modified NASA thread 103 initially sets the NASS ownership and the NASW ownership to the first thread (i.e., PID=1).

In the example of FIG. 8, the NASS thread 92 had opened a file A, and had inserted a descriptor of the meta data buffer for file A onto the list of open files 95. Then the backup-1 thread 100 had used the descriptor for file A from the list of open files to get the meta data buffer for the file A and read data from file A into data buffers 93 on a local list of buffers that has become linked to the write list of buffers 105.

The NASS thread 92 had also opened a file B, and had inserted a descriptor of the metadata buffer for file B onto the list of open files 95. Then the backup-2 thread 101 obtained the descriptor of the meta data buffer for file B from the list of open files 95 to read data from file B into buffers 93 on a local list of buffers 106.

The NASS thread 92 had also opened a file C, and had inserted a descriptor of the meta data buffer for file C onto the list of open files 95. The backup-3 thread 102 had used the descriptor of the meta data buffer for file C from the list of open files 95 to read data from file C into the buffers 93 on a local list of buffers 107.

For efficient use of data mover buffer memory, there is a limit on the amount of file data that a backup thread 100, 101, 102 can prefetch into the data buffers 93 on its local list of buffers before it becomes the NASW owner. For example, each backup thread that is not the NASW owner can prefetch up to 128 kilobytes of file data.

FIG. 9 shows the organization of a local list of buffers used in FIG. 7. The local list of buffers includes a descriptor 111 of the file header meta data buffer, and one or more descriptors 112, 113, 114 of file data buffers.

FIG. 10 shows the locking information 104 for organizing the active backup threads into a queue. This information includes the NASS owner backup thread PID 121 and the NASW owner backup thread PID 122.

In general, the backup software in FIG. 8 is designed to use an NDMP remote control routine 91, a NASS thread 92, and a NASW thread 94 that are similar to the NDMP remote control routine 41, NASS thread 42, and NASW thread 44, respectively, that were used in the backup software of FIG. 2. The NASA thread 43 is modified so that multiple concurrent instances of a backup thread routine perform the file reading and buffer filling operations of the NASA thread 43.

FIG. 11 shows a first sheet of a flowchart of the modified NASA thread 103 for the backup software of FIG. 8. Steps 131, 132, 133, and 134 are similar to steps 71 to 74 of FIG. 5. In step 135, the modified NASA thread sets the nass_owner to a PID value of 1. In step 136, the modified NASA thread sets the nasw_owner to a PID value of 1. In step 137, the modified NASA thread initiates the pre-programmed number (N) of instances of the backup code thread routine, with respective initial PID values of 1, 2, 3, . . . , N. Execution continues from step 137 of FIG. 11 to step 141 of FIG. 12. In step 141, if thirty data buffers 30 have been filled, then execution continues from step 141 to step 143. Execution also continues from step 142 to step 143 if the end of the file system has been reached. In step 143, the NASA thread invokes the NASW thread to begin writing to tape, and the NASA thread terminates. Otherwise, if less than 30 data buffers have been filled and the end of the file system has not been reached, then execution continues from step 143 to step 144. In step 144, the modified NASA thread is put in a wait state until another data buffer is filled or until the end of the file system has been reached. Then execution loops back to step 141 from step 144.

FIG. 13 shows the backup thread routine. In a first step 151, the backup thread checks whether its PID is the value of the nass_owner variable. If not, the backup thread is put in a wait state in step 152 until it becomes the NASS owner. Then execution continues from step 151 to step 153. In step 153, the backup thread removes the file descriptor and the buffer descriptor from the head of the list of open files. In step 154, the backup thread inserts the buffer descriptor onto the tail its local list of buffers. Then the backup thread passes NASS ownership to the next backup thread instance in the PID sequence. In particular, in step 155, if the value of nass_owner is less than N, then execution branches to step 156 to increment nass_owner by one. Otherwise, execution continues from step 155 to step 157, to set nass_owner to one. After step 156 or step 157, execution continues to step 158. In step 158, the backup thread activates the next backup thread instance, having a PID equal to the value of nass_owner. Execution continues from step 158 to step 161 in FIG. 14.

In step 161 of FIG. 14, the backup thread gets a free data buffer. In step 162, the backup thread reads data from the file into the data buffer. In step 163, the backup thread inserts a descriptor of the data buffer onto the tail of the local list of buffers.

In step 164, if the PID of the backup thread is not equal to the value of the variable nasw_owner, then execution branches to step 165. In step 165, if the end of the file has been reached, then execution continues to step 161 to put the backup thread in a wait state until the value of the variable nasw_owner becomes equal to the PID of the backup thread. In step 165, if the end of the file has not been reached, then execution continues to step 166. In step 166, if the local list for the backup thread has less than two data buffers, then execution loops back to step 161. Otherwise, execution branches from step 166 to step 167. This limits prefetching of data from the file by the backup thread to two buffers of data, before the local list of buffers is linked onto the write list. Once the value of nasw_owner becomes equal to the PID of the backup thread, execution continues from step 164 to step 168 to link the local list of buffers onto the write list. Execution continues from step 168 of FIG. 14 to step 171 of FIG. 15.

In step 171 of FIG. 15, if the end of the file has not been reached, then execution branches to step 172 to get a free data buffer in step 172, to read data from the file into the data buffer in step 173, to insert a descriptor of the data buffer onto the tail of the write list in step 174, and to loop back to step 171. Once all of the file data has been read and put into data buffers linked to the write list, execution continues from step 171 to step 175. In step 175, the backup thread closes the file.

In steps 176 to 179, the backup thread passes NASW ownership to the next backup thread instance in the PID sequence. In particular, in step 176, if the value of nasw_owner is less than N, then execution branches to step 177 to increment nasw_owner by one. Otherwise, execution continues from step 176 to step 178, to set nasw_owner to one. After step 177 or step 178, execution continues to step 179. In step 179, the backup thread activates the next backup thread instance, having a PID equal to the value of nasw_owner. Execution loops back from step 179 to step 151 in FIG. 13.

It is also desirable to use multiple concurrent instances of a thread routine for streaming data from many small files in the network file server of FIG. 1 over the IP network 25. This can be done using multiple threads similar to the threads shown in FIG. 7 except that the NASW thread is replaced with a thread for writing to a network port of the file server.

For streaming data from files in the network file server of FIG. 1 to backup tape or over an IP network, it is also possible to obtain an improvement by prefetching data blocks from disk storage to cache storage. This prefetching of data blocks to cache is particularly helpful when the file size is greater than eight kilobytes and when responding read requests from network clients.

FIG. 16, for example, shows various software modules of the data mover 21 in the network file server of FIG. 1. The data mover 21 has a Network File System (NFS) module 201 for supporting communication with the data mover over the IP network 25 using the NFS file access protocol, and a Common Internet File System (CIFS) module 202 for supporting communication with the data mover over the IP network using the CIFS file access protocol. The NFS module 201 and the CIFS module 202 are layered over a Common File System (CFS) module 203, and the CFS module is layered over a Universal File System (UxFS) module 204. The UxFS module supports a UNIX-based file system, and the CFS module 203 provides higher-level functions common to NFS and CIFS.

The UxFS module 204 accesses data organized into logical volumes defined by a module 205. Each logical volume maps to contiguous logical storage addresses in the cached disk array 29. The module 205 is layered over a SCSI driver 206 and a Fibre-channel protocol (FCP) driver 207. The data mover 21 sends storage access requests through a host bus adapter 208 using the SCSI protocol, the iSCSI protocol, or the Fibre-Channel protocol, depending on the physical link between the data mover 208 and the cached disk array 29.

A network interface card 209 in the data mover 21 receives IP data packets from the IP network 25. A TCP/IP module 210 decodes data from the IP data packets for the TCP connection and stores the data in message buffers 211. For example, the UxFS layer 204 writes data from the message buffers 211 to the file system 35 in the cached disk array 29. The UxFS layer 204 also reads data from the file system 35 or a file system cache 212 and copies the data into the message buffers 211 for transmission to the network clients 213, 214.

In an old design for the CFS layer 203, when the CFS layer was requested to read 64 kilobytes of data at offset zero from a single file, it issued eight input-output operations of eight kilobytes each, one after the other, without any prefetch. This old design is improved considerably by use of concurrent read threads in combination with prefetching. For this purpose, the data mover 21 maintains a CFS thread pool 215, further described below with reference to FIGS. 18 and 19.

As shown in FIG. 17, data are streamed from the file system 35 to a Windows client 213 using the CIFS file access protocol. For CIFS, the message block size is 2 kilobytes. To fill the message buffers 211 to satisfy a client request for data from a file, the data are read from the file system cache 212 if the data presently reside in the cache 212, or else the data are read from the file system 35 in the cached disk array. The data block size of the file system cache 212 is 8 kilobytes. In response to a client request, the CIFS layer looks at the request and determines how many 8K file blocks are needed to satisfy the request, and initiates a fetch operation for each 8K file block to fetch the file block from the file system 35 in the cache disk array if the file block is not already in the file system cache. The fetch operations are performed in parallel by a respective thread for fetching each 8K file block.

The CIFS layer may also respond to a client request for file data by prefetching file blocks that are not needed to satisfy the client request but that are likely to be requested in a subsequent client request. For example, if a client requests 64 kilobytes of contiguous file data aligned on the cache block boundaries, the CIFS layer fetches eight 8-kilobyte blocks of the requested file data, anticipates that the client is likely to be streaming data from the file, checks whether the file has at least 64 kilobytes of file data following the requested 64 kilobytes, and upon finding that the file has at least 64 kilobytes following the requested 64 kilobytes, prefetches an additional eight 8-kilobyte blocks of the following file data. Each additional 8-kilobyte block is prefetched by a separate respective prefetch thread that checks whether the 8-kilobyte data block resides in the file system cache 212, and if not, reads the data block from the file system 35 in the cached disk array 29, and writes the data block into the file system cache 212.

Each prefetch thread is a low priority thread relative to the fetch threads and the other threads that are needed to satisfy a client request. Therefore, any prefetch thread is executed as a background process when there otherwise would be idle processing time in the data mover.

As shown in FIG. 18, the CFS thread pool 215 includes a main thread 216, multiple block read threads 217, and a prefetch thread 218. In this preferred organization, the main thread 216 fetches one 8 kilobyte block and activates a respective one of the block read threads 217 to fetch each additional 8 kilobyte block needed to satisfy a CFS file read operation. The prefetch thread 218 prefetches one 8 kilobyte block and activates a respective one of the block read threads 217 to prefetch each additional 8 kilobyte block to be prefetched as a result of a CFS file read operation.

A thread activating one of the block read threads 217 can set a parameter of the block read thread to indicate whether the block read thread is to function as a fetch thread or a prefetch thread. A block read thread functioning as a fetch thread is given a high priority, and a block read thread functioning as a prefetch thread is given a low priority.

FIG. 19 shows how the CFS layer uses the threads in the CFS thread pool to respond to a request to read 64 kilobytes of data at offset zero from a single file. In a first step 221 of FIG. 19, the main thread activates seven block read operations in parallel. A respective thread performs each read operation by reading a respective eight-kilobyte block within the 64 kilobytes at offset zero in the file. For example, the main thread activates seven block read threads, one for each of the first seven eight-kilobyte blocks within the 64 kilobytes at offset zero in the file.

Next, in step 222, the main thread instantiates a prefetch thread that emulates a request to read 64 kilobytes from the file beginning at offset 64 kilobytes. Then in step 223, the main thread activates an eighth block read operation in order to read the last one of the eight blocks, and the main thread is suspended until all eight block read operations have completed the reading of their respective eight kilobyte blocks for the 64 kilobytes at offset zero in the file. Once all eight of the block read operations have been completed, in step 224 the main thread is awoken and completes the CFS layer read operation, for example, by transferring the 64 kilobytes of data from the file system cache to the message buffers. Then the main thread and the seven block read threads are returned to a waiting state in the CFS thread pool.

FIG. 20 shows the various objects referred to in the procedure of FIG. 19. The main thread 216 initiates eight block read operations 231, 232, 233, each reading a respective 8 KB block 234, 235, 236 in a first series of 8 KB blocks in the 64 kilobyte chunk of data at offset=0 in the file. Then the main thread 216 initiates the prefetch thread 218 that also initiates eight block read operations 237, 238, 239, each reading a respective 8 KB block 241, 242, 243 in a second series of 8 KB blocks in the 64 KB chunk of data at offset=64 KB in the file.

FIG. 21 shows the procedure for each block read thread, which reads a specified 8 KB block (referred to as block “X”). In a first step 251, the block read thread accesses the file system cache directory to look for the specified 8 KB block. If the block is not found in the file system cache, then execution continues from step 252 to step 253. In step 253, the block read thread reads the specified block from the file system in storage and writes the block to the file system cache. Execution continues from step 253 to step 254. Execution also branches to step 254 from step 252 if the specified block is found in the cache. In step 254, if the block read thread is for a fetch operation, then execution branches to step 255. In step 255, the block read thread returns the cache block address of the specified block to the process having activated the block read thread, and then the block read thread is suspended. In step 254, if the block read thread is not for a fetch operation, then the block read thread is for a prefetch operation and the block read thread is suspended. The block read thread is suspended by returning the block read thread to a waiting state in the CFS thread pool.

As shown in FIG. 22, the CFS main thread responds to a request to read a file by first checking the “offset” and “IO-size” specified by the read request. The offset is the logical address in the file at which the read operation is to begin, and the IO-size is the number of bytes to be read from the file, unless an “end of file” is reached before the requested number of bytes has been read. In a first step 271, the main thread compares the offset to the size of the file. If the offset is not less than the size of the file, then the main thread returns no data in response to the read request and the main thread is finished responding to the read request. Otherwise, execution continues to step 272. In step 272, the main thread limits the IO_size specified by the read request to the file size less the offset. In other words, if the IO_size specified by the read request is greater than the difference between the file size and the offset, then the IO_size is set equal to the difference between the file size and the offset.

In step 273, the main thread computes the number (N) of data blocks to be read, in order to read all of the bytes indicated by the IO_size. For example, the integer division of the offset by 8 kilobytes gives the block address of the first byte, the integer division of the sum of the offset plus the IO_size minus one by 8 kilobytes gives the block address of the last byte, and the difference between the block address of the last byte and the block address of the first byte plus one gives the number (N) of data blocks to be read.

In step 274, if the number (N) of data blocks to be read is not equal to one, then the number (N) of data blocks is greater than one, and execution continues to step 275. In step 275, the main thread activates N−1 block read threads to fetch the first N−1 blocks of the N data blocks. However, there is a limit (TH1) to the number block read threads that can be busy at any given time. For example, the default value of TH1 is 256. If the main thread needs to activate a block read thread and all of these (TH1) block read threads are busy, then the main thread is suspended and resumes once a block read thread is returned to a wait state in the CFS thread pool. Execution continues from step 275 to step 276. Execution also continues to step 276 from step 274 if the number (N) of data blocks is equal to one.

In step 276, the main thread inspects a parameter (n) that specifies a desired depth of prefetching. If the parameter (n) is equal to zero, then there will be no prefetching of data blocks by the CFS layer during a read of the file, and execution branches from step 276 to step 280 in FIG. 23. Otherwise, execution continues from step 276 to step 277 in FIG. 23 to prefetch a number of data blocks equal to the number (N) of fetched blocks multiplied by the parameter (n). Thus, in step 277, the main thread computes a “prefetch_IO_size” equal to the product (N*n*8) kilobytes, and in step 278, the main thread computes a “prefetch_offset” equal to 8 kilobytes plus the byte address of the last block (N) being fetched. In step 279, if the prefetch thread is not busy, and no more than a certain number (TH2) of block read threads will be busy prefetching, then the main thread activates the prefetch thread. The main thread passes the prefetch_IO_size and the prefetch_offset as parameters to the prefetch thread.

The number TH2 is a preselected maximum number of block read threads that can be used for prefetching at any given time. For example, the default value of TH2 is 25% of the value of TH1. Step 279 enforces this limit (TH2) by accessing a count of the number of block read threads that are presently active for prefetching, and checking whether this count plus the number (N*n) of blocks in the prefetch_IO_size exceeds the number TH2. If so, then step 279 does not activate the prefetch thread, and execution continues to step 280.

In step 280, the main thread begins a fetch of the last block of the N data blocks, or a fetch of the single block for the case where N is equal to one. In particular, the main thread accesses the file system cache directory to look for this block in the cache, and if this block is not found in the cache, then the main thread begins a read of this block from the file system in storage, and once this block is read from the file system in storage, it is written to the file system cache. Execution continues from step 280 to step 281.

In step 281, the main thread is suspended until the (N) block reads have completed. Finally, in step 282, the main thread completes the CFS layer read operation, for example, by transferring the requested data from the file system cache to the message buffers, and building a list of these message buffers.

As shown in FIG. 24, the prefetch thread executes in a fashion similar to the main thread as shown in FIGS. 22 and 23, except that the prefetch thread will not start another prefetch thread, and the prefetch thread will update the file system cache without transferring the requested data to the message buffers or building a list of message buffers. In particular, in a first step 291 of FIG. 24, the prefetch thread compares the prefetch offset to the size of the file. If the prefetch offset is not less than the file size, then the prefetch thread returns no data in response to the read request and the prefetch thread is finished responding to the read request. The prefetch thread returns to a wait state in the CFS thread pool. Otherwise, execution continues to step 292. In step 292, the prefetch thread limits the prefetch IO_size to the file size less the prefetch offset.

In step 293, the prefetch thread computes the number (N) of data blocks to be prefetched. For example, the integer division of the prefetch_offset by 8 kilobytes gives the block address of the first byte to be prefetched, the integer division of the sum of the prefetch_offset plus the prefetch_IO_size minus one by 8 kilobytes gives the block address of the last byte to be prefetched, and the difference between the block address of the last byte and the block address of the first byte plus one gives the number (N) of data blocks to be prefetched. In step 294, if the number of data blocks to be prefetched is equal to one, then execution branches to step 295. Otherwise, in step 294, if the number (N) of data blocks to be prefetched is not equal to one, then the number (N) is greater than one, and execution continues to step 295.

In step 295, the prefetch thread activates N−1 block read threads to prefetch the first N−1 blocks of the N data blocks. The prefetch thread is suspended and resumes if a block tread thread is needed ant all (TH1) of the block read threads are busy. Execution continues from step 295 to step 296.

In step 296, the prefetch thread prefetches the last block of the N data blocks, or for the case of N=1, the single block, for example, by accessing the file system cache directory to look for this block, and if this block is not in the file system cache, then reading this block from the file system in storage and writing this block to the file system cache. Then the prefetch thread is finished responding to the prefetch request, and it returns to a wait state in the CFS thread pool.

It is possible to provide multiple main threads that share the block read threads in the CFS thread pool. For example, there could be one main thread for handling file read requests from CIFS, and another main thread for handling file read requests from NFS. In addition, the NASA thread may be programmed as a main thread that reads blocks of file data in a fashion similar to the main thread shown in FIGS. 22 and 23. Each of these main threads may have a respective prefetch thread. These main threads and their respective prefetch threads may share the block read threads.

Although each instance of a thread routine can be created, scheduled, prioritized, and terminated using conventional operating system routines, it should be appreciated that instances of a thread routine can also be created, scheduled, prioritized, and terminated using machine language instructions and appropriate processor stack manipulations. For example, in its most elementary form, a multi-tasking operating system is nothing more than a thread handler routine that services a periodic timer interrupt of a processor. In response to a timer interrupt, the processing of a current thread is interrupted by pushing the contents of the processor registers onto the processor stack, and then beginning execution of the thread handler routine. The thread handler routine maintains a queue of threads and a record of the processor register state, status (e.g., active, suspended, waiting on condition) and priority level of each thread. The thread handler decides what thread should next be executed, and if it decides that execution should be passed to some thread other than the interrupted thread, the thread handler removes the state of the interrupted thread from the stack and saves the state of the interrupted thread, and pushes the processor register state of the next thread to be executed upon the stack. Then the thread handler executes a “return from interrupt” machine instruction to resume execution of either the interrupted thread or the next thread to be executed.

In view of the above, there has been described a problem of small file performance arising in backup software due to a bottleneck in a thread that reads data from the files in the file system. Permitting multiple concurrent instances of a new thread routine for concurrent read operations upon the file system solves this problem. Multiple concurrent instances of the new thread could cause inefficient use of buffer memory and processing time and could also cause a loss in ordering of the file data due to the fact that the order in which the data are returned from the file system may be different from the order in which the read operations are requested. These problems are avoided by reading each file with a corresponding one of the instances of the new thread routine, reading the data from each file into a series of buffers for each file, ordering each instance of the new thread routine with a PID, linking the series of buffers of each file to a write list when the instance of the new thread routine becomes the owner of the write list, and suspending the instance of the new thread routine once a certain amount of data are read from the file so long as data from the file are not being streamed from the buffers. A similar bottleneck may arise when streaming data to a network client from a number of small files. This bottleneck is also solved by creating multiple concurrent instances of a thread routine that reads data from a file (in a file system cache or in disk storage), and writes the data to message buffers for transmission over a data network to the network client. 

1. A computer-implemented method of streaming data from a series of files in a file system in data storage of a file server and through buffers in the file server, the computer-implemented method comprising: initiating a series of concurrent file read requests and providing a respective thread for handling data read from the data storage from each file in the series of files, the respective thread for handling the data from said each file transferring the data read from said each file into a series of the buffers for said each file; and streaming data from the buffers; wherein the method further includes providing a respective process identifier for identifying each of the threads, and using the process identifiers for ordering the data streamed from the buffers in a certain order by file.
 2. The method as claimed in claim 1, wherein the files are in the certain order by file in the file system.
 3. The computer-implemented method as claimed in claim 1, in which the data are streamed in the certain order by file from a write list of the buffers, the respective thread maintains a respective list of the buffers in the series of buffers for said each file, and the respective list of buffers in the series of buffers for said each file is linked to the write list of buffers when ownership of the write list of buffers is assigned to the process identifier for the thread.
 4. The computer-implemented method as claimed in claim 1, which includes maintaining a list of open files, and which includes assigning the respective thread to said each file by the respective thread obtaining ownership of the list of open files, and then assigning the file at the head of the list of open files to the respective thread.
 5. A computer-implemented method of streaming data from a file system in data storage of a file server and thorough buffers in the file server, the computer-implemented method comprising: searching the file system to find a series of files in the file system, and upon finding a file to be included in the series of files in the file system, creating a respective instance of a thread routine for handling file data returned from a read operation upon the file in the data storage and initiating the read operation upon the file in the data storage so that there are multiple concurrent read operations pending upon multiple files in the series of files in the file system; the respective instance of the thread routine for handling file data returned from the read operation upon the file in the data storage determining whether there are additional data in the file in the data storage and upon finding that there are additional data in the file in the data storage initiating at least one additional read operation upon the file in the data storage, and placing all of the data of the file into a respective series of the buffers for the file; and streaming the data from the buffers in the order of the series of files in the file system; wherein the data are streamed from the buffers in the order of the series of files in the file system by assigning a process identifier to the respective instance of the thread routine, the process identifier indicating the order of the file in the series of files in the file system, and using the process identifier to select the respective series of buffers for streaming of the data from the buffers.
 6. The computer-implemented method as claimed in claim 5, wherein the process identifier is used to select the respective series of buffers for streaming of the data from the respective series of buffers by streaming the data from a write list of the buffers and linking a respective list of the buffers in the respective series of buffers to the write list of buffers when ownership of the write list of buffers becomes assigned to the process identifier for the respective instance of the thread routine.
 7. The computer-implemented method as claimed in claim 5, wherein the process identifier is assigned to the instance of the thread routine when the instance of the thread routine is created.
 8. The computer-implemented method as claimed in claim 5, wherein the instance of the thread routine is assigned to handle data of the file by the instance of the thread routine obtaining ownership of the list of open files and then accessing the list of open files to obtain a next open file on the list of open files.
 9. The computer-implemented method as claimed in claim 5, wherein the instance of the thread routine issues the request for the read operation upon the file.
 10. The computer-implemented method as claimed in claim 5, wherein the instance of the thread routine is suspended after processing a certain amount of the data from the file if data from the file is not being streamed from the buffers.
 11. A file server comprising: data storage for storing a file system; buffers for buffering data; and a processor programmed for streaming data from the data storage from a series of files in the file system and through the buffers; wherein the processor is programmed for initiating a series of concurrent file read requests and providing a respective thread for handling data read from the data storage from each file in the series of files, the respective thread for handling the data read from said each file transferring the data read from said each file into a series of the buffers for said each file, the processor is programmed for streaming data from the buffers, and the processor is programmed for providing a respective process identifier for identifying each of the threads, and using the process identifiers for ordering the data streamed from the buffers in a certain order by file.
 12. The file server as claimed in claim 11, wherein the files are in the certain order by file in the file system.
 13. The file server as claimed in claim 11, wherein the processor is programmed for streaming the data in the certain order by file from a write list of the buffers, for maintaining a respective list of the buffers in the series of buffers for said each file, and for linking the series of buffers for said each file to the write list of buffers when ownership of the write list is assigned to the process identifier for the respective thread.
 14. The file server as claimed in claim 11, wherein the processor is programmed for maintaining a list of open files, and for assigning the respective thread to said each file by the respective thread obtaining ownership of the list of open files, and assigning the file at the head of the list of open files to the respective thread.
 15. A file server comprising: storage containing a file system; buffers; and a processor programmed for searching the file system to find a series of files in the file system, and upon finding a file to be included in the series of files in the file system, initiating a respective instance of a thread routine for handling file data returned from a read operation upon the file in the storage and initiating the read operation upon the file in the storage so that there are multiple concurrent read operations pending to multiple files in the series of files in the file system; wherein the thread routine is programmed for handling file data returned from the read operation upon the file in the storage by determining whether there are additional data in the file and upon finding that there are additional data in the file initiating at least one additional read operation upon the file in the storage, and placing all of the data of the file into a respective series of the buffers for the file; wherein the processor is programmed for streaming the data from the buffers in the order of the series of files in the file system; and wherein the processor is programmed for streaming the data from the buffers in the order of the series of files in the file system by assigning a process identifier to the respective instance of the thread routine, the process identifier indicating the order of the file in the series of files in the file system, and using the process identifier to select the respective series of the buffers for streaming of the data from the buffers.
 16. The file server as claimed in claim 15, wherein the processor is programmed for using the process identifier to select the respective series of the buffers for streaming of the data from the buffers by streaming the data from a write list of the buffers and linking a respective list of the buffers in the respective series of the buffers to the write list of buffers when ownership of the write list of buffers is assigned to the process identifier for the respective instance of the thread routine.
 17. The file server as claimed in claim 15, wherein the processor is programmed to assign the process identifier to the respective instance of the thread routine when the respective instance of the thread routine is created.
 18. The file server as claimed in claim 15, wherein the processor is programmed to assign the respective instance the thread routine to handle data of the file by the respective instance of the thread routine obtaining a lock on the list of open files and then accessing the list of open files to obtain a next open file on the list to be read.
 19. The file server as claimed in claim 15, wherein the thread routine is programmed to issue the request for the read operation upon the file.
 20. The file server as claimed in claim 15, wherein the processor is programmed to suspend the respective instance of the thread routine after processing a certain amount of the data from the file if data from the file is not being streamed from the buffers. 